Browsing by Subject "Parameterized Algorithms"
Now showing items 1-2 of 2
-
(2010-01-14)The k-path problem is to find a simple path of length k. This problem is NP-complete and has applications in bioinformatics for detecting signaling pathways in protein interaction networks and for biological subnetwork ...
-
(2010-10-12)NP-hard problems have numerous applications in various fields such as networks, computer systems, circuit design, etc. However, no efficient algorithms have been found for NP-hard problems. It has been commonly believed ...